Analysis of speculative prefetching

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resource-aware Speculative Prefetching in Wireless Networks

Mobile users connected to wireless networks expect performance comparable to those on wired networks for interactive multimedia applications. Satisfying Quality of Service (QoS) requirements for such applications in wireless networks is a challenging problem due to limitations of low bandwidth, high error rate and frequent disconnections of wireless channels. In addition, wireless networks suff...

متن کامل

Effect of Speculative Prefetching on Network Load in Distributed Systems

Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper, on the other hand, investigates the performance of speculative prefetching. When prefetching is performed speculatively, there is bound to be an increase in the network load. Furthermore, the prefetched items must compete for space with existing cache occu...

متن کامل

A Performance Model of Speculative Prefetching in Distributed Information Systems

Previous studies in speculative prefetching focus on building and evaluating access models for the purpose of access prediction. This paper investigates a complementary area which has been largely ignored, that of performance modelling. We use improvement in access time as the performance metric, for which we derive a formula in terms of resource parameters (time available and time required for...

متن کامل

Speculative prefetching of optional locks in distributed systems

We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applications. In the worst case, some of our methods will not produce higher network latencies than equivalent conventional distributed locking methods. In best case, the total number of messages can be constantly bounded, appro...

متن کامل

Job-Speculative Prefetching: Eliminating Page Faults From Context Switches in Time-Shared Systems

When multiple applications have to time-share limited physical memory resources, they can incur significant performance degradation at the beginning of their respective time slices due to page faults. We propose a method to significantly improve memory system and overall performance in time-shared computers using job-speculative prefetching. While a given job or jobs are running, the operating ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGMOBILE Mobile Computing and Communications Review

سال: 2002

ISSN: 1559-1662,1931-1222

DOI: 10.1145/565702.565706